$K$-mean convex and $K$-outward minimizing sets

نویسندگان

چکیده

We consider the evolution of sets by nonlocal mean curvature and we discuss preservation along flow two geometric properties, which are convexity outward minimality. The main tools in our analysis level set formulation minimizing movement scheme for flow. When initial is minimizing, also show convergence (time integrated) perimeters discrete evolutions to perimeter limit

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing k-Regret Minimizing Sets

Regret minimizing sets are a recent approach to representing a dataset D by a small subset R of size r of representative data points. The set R is chosen such that executing any top-1 query on R rather than D is minimally perceptible to any user. However, such a subset R may not exist, even for modest sizes, r. In this paper, we introduce the relaxation to k-regret minimizing sets, whereby a to...

متن کامل

Convex Quadrilaterals and k-Sets

We prove that the minimum number of convex quadrilaterals determined by n points in general position in the plane – or in other words, the rectilinear crossing number of the complete graph Kn – is at least ( 38 + 10 −5) ( n 4 ) +O(n). Our main tool is a lower bound on the number of (≤ k)-sets of the point set: we show that for every k ≤ n/2, there are at least 3 ( k+1 2 ) subsets of size at mos...

متن کامل

On k-convex point sets

We extend the (recently introduced) notion of k-convexity of a two-dimensional subset of the Euclidean plane to finite point sets. A set of n points is ∗Corresponding author. Email addresses: [email protected] (Oswin Aichholzer), [email protected] (Franz Aurenhammer), [email protected] (Thomas Hackl), [email protected] (Ferran Hurtado), [email protected] (Alexander Pilz), pedro.ramos@uah...

متن کامل

Efficient Algorithms for k-Regret Minimizing Sets

A regret minimizing set Q is a small size representation of a much larger database P so that user queries executed on Q return answers whose scores are not much worse than those on the full dataset. In particular, a k-regret minimizing set has the property that the regret ratio between the score of the top-1 item in Q and the score of the top-k item in P is minimized, where the score of an item...

متن کامل

Convex domains and K-spectral sets

Let Ω be an open convex domain of C. We study constants K such that Ω is K-spectral or complete K-spectral for each continuous linear Hilbert space operator with numerical range included in Ω. Several approaches are discussed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Interfaces and Free Boundaries

سال: 2021

ISSN: ['1463-9963', '1463-9971']

DOI: https://doi.org/10.4171/ifb/466